0.00/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.12/0.12	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.13/0.33	% Computer   : n013.cluster.edu
0.13/0.33	% Model      : x86_64 x86_64
0.13/0.33	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.33	% Memory     : 8042.1875MB
0.13/0.33	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.33	% CPULimit   : 1200
0.13/0.33	% WCLimit    : 120
0.13/0.33	% DateTime   : Tue Jul 13 13:45:18 EDT 2021
0.13/0.33	% CPUTime    : 
0.13/0.33	% Number of cores: 8
0.13/0.34	% Python version: Python 3.6.8
0.13/0.34	# Version: 2.6rc1-ho
0.19/0.34	# No SInE strategy applied
0.19/0.34	# Trying AutoSched0 for 59 seconds
0.19/0.39	# AutoSched0-Mode selected heuristic G_E___208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
0.19/0.39	# and selection function SelectComplexExceptUniqMaxHorn.
0.19/0.39	#
0.19/0.39	# Preprocessing time       : 0.029 s
0.19/0.39	# Presaturation interreduction done
0.19/0.39	
0.19/0.39	# Proof found!
0.19/0.39	# SZS status Theorem
0.19/0.39	# SZS output start CNFRefutation
0.19/0.39	thf(beta1, conjecture, (dpsetconstrI=>(lamp=>(funcGraphProp2=>![X1:$i, X2:$i, X8:$i > $i]:(![X4:$i]:((ap @ X1 @ X2 @ (lam @ X1 @ X2 @ (^[X5:$i]:X8 @ X5)) @ X4)=(X8 @ X4)<=in @ X4 @ X1)<=![X4:$i]:(in @ X4 @ X1=>in @ (X8 @ X4) @ X2))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', beta1)).
0.19/0.39	thf(dpsetconstrI, axiom, (dpsetconstrI<=>![X1:$i, X2:$i, X3:$i > $i > $o, X4:$i]:(in @ X4 @ X1=>![X5:$i]:(in @ X5 @ X2=>(X3 @ X4 @ X5=>in @ (kpair @ X4 @ X5) @ (dpsetconstr @ X1 @ X2 @ (^[X6:$i, X7:$i]:X3 @ X6 @ X7)))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', dpsetconstrI)).
0.19/0.39	thf(lamp, axiom, (lamp<=>![X1:$i, X2:$i, X8:$i > $i]:(![X4:$i]:(in @ X4 @ X1=>in @ (X8 @ X4) @ X2)=>func @ X1 @ X2 @ (lam @ X1 @ X2 @ (^[X4:$i]:X8 @ X4)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', lamp)).
0.19/0.39	thf(funcGraphProp2, axiom, (funcGraphProp2<=>![X1:$i, X2:$i, X9:$i]:(func @ X1 @ X2 @ X9=>![X4:$i]:(in @ X4 @ X1=>![X5:$i]:(in @ X5 @ X2=>(in @ (kpair @ X4 @ X5) @ X9=>(ap @ X1 @ X2 @ X9 @ X4)=(X5)))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', funcGraphProp2)).
0.19/0.39	thf(lam, axiom, (lam)=(^[X1:$i, X2:$i, X8:$i > $i]:dpsetconstr @ X1 @ X2 @ (^[X4:$i, X5:$i]:(X8 @ X4)=(X5))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', lam)).
0.19/0.39	thf(c_0_5, plain, ![X4:$i, X8:$i > $i]:(esk1_2 @ X8 @ X4)=(X8 @ X4), introduced(definition)).
0.19/0.39	thf(c_0_6, plain, ![X7:$i, X6:$i, X3:$i > $i > $o]:(epred2_3 @ X3 @ X6 @ X7<=>X3 @ X6 @ X7), introduced(definition)).
0.19/0.39	thf(c_0_7, plain, ![X30:$i, X29:$i, X8:$i > $i]:(epred1_3 @ X8 @ X29 @ X30<=>(X8 @ X29)=(X30)), introduced(definition)).
0.19/0.39	thf(c_0_8, negated_conjecture, ~((![X1:$i, X2:$i, X3:$i > $i > $o, X4:$i]:(in @ X4 @ X1=>![X5:$i]:(in @ X5 @ X2=>(X3 @ X4 @ X5=>in @ (kpair @ X4 @ X5) @ (dpsetconstr @ X1 @ X2 @ (epred2_3 @ X3)))))=>(![X1:$i, X2:$i, X8:$i > $i]:(![X4:$i]:(in @ X4 @ X1=>in @ (X8 @ X4) @ X2)=>func @ X1 @ X2 @ (lam @ X1 @ X2 @ (esk1_2 @ X8)))=>(![X1:$i, X2:$i, X9:$i]:(func @ X1 @ X2 @ X9=>![X4:$i]:(in @ X4 @ X1=>![X5:$i]:(in @ X5 @ X2=>(in @ (kpair @ X4 @ X5) @ X9=>(ap @ X1 @ X2 @ X9 @ X4)=(X5)))))=>![X1:$i, X2:$i, X8:$i > $i]:(![X4:$i]:(in @ X4 @ X1=>in @ (X8 @ X4) @ X2)=>![X4:$i]:(in @ X4 @ X1=>(ap @ X1 @ X2 @ (lam @ X1 @ X2 @ (esk1_2 @ X8)) @ X4)=(X8 @ X4))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[beta1]), dpsetconstrI]), lamp]), funcGraphProp2]), c_0_5]), c_0_5]), c_0_6])])).
0.19/0.39	thf(c_0_9, plain, ![X1:$i, X2:$i, X8:$i > $i]:(lam @ X1 @ X2 @ X8)=(dpsetconstr @ X1 @ X2 @ (epred1_3 @ X8)), inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[lam]), c_0_7])).
0.19/0.39	thf(c_0_10, negated_conjecture, ![X34:$i, X35:$i, X36:$i > $i > $o, X37:$i, X38:$i, X39:$i, X40:$i, X41:$i > $i, X43:$i, X44:$i, X45:$i, X46:$i, X47:$i, X51:$i]:((~in @ X37 @ X34|(~in @ X38 @ X35|(~X36 @ X37 @ X38|in @ (kpair @ X37 @ X38) @ (dpsetconstr @ X34 @ X35 @ (epred2_3 @ X36)))))&(((in @ (esk2_3 @ X39 @ X40 @ X41) @ X39|func @ X39 @ X40 @ (lam @ X39 @ X40 @ (esk1_2 @ X41)))&(~in @ (X41 @ (esk2_3 @ X39 @ X40 @ X41)) @ X40|func @ X39 @ X40 @ (lam @ X39 @ X40 @ (esk1_2 @ X41))))&((~func @ X43 @ X44 @ X45|(~in @ X46 @ X43|(~in @ X47 @ X44|(~in @ (kpair @ X46 @ X47) @ X45|(ap @ X43 @ X44 @ X45 @ X46)=(X47)))))&((~in @ X51 @ esk3_0|in @ (esk5_0 @ X51) @ esk4_0)&(in @ esk6_0 @ esk3_0&(ap @ esk3_0 @ esk4_0 @ (lam @ esk3_0 @ esk4_0 @ (esk1_2 @ esk5_0)) @ esk6_0)!=(esk5_0 @ esk6_0)))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])])).
0.19/0.39	thf(c_0_11, plain, ![X31:$i, X32:$i, X33:$i > $i]:(lam @ X31 @ X32 @ X33)=(dpsetconstr @ X31 @ X32 @ (epred1_3 @ X33)), inference(variable_rename,[status(thm)],[c_0_9])).
0.19/0.39	thf(c_0_12, negated_conjecture, ![X1:$i, X3:$i > $i > $o, X2:$i, X5:$i, X4:$i]:(in @ (kpair @ X1 @ X4) @ (dpsetconstr @ X2 @ X5 @ (epred2_3 @ X3))|~in @ X1 @ X2|~in @ X4 @ X5|~X3 @ X1 @ X4), inference(split_conjunct,[status(thm)],[c_0_10])).
0.19/0.39	thf(c_0_13, plain, ![X1:$i, X2:$i, X8:$i > $i]:(lam @ X1 @ X2 @ X8)=(dpsetconstr @ X1 @ X2 @ (epred1_3 @ X8)), inference(split_conjunct,[status(thm)],[c_0_11])).
0.19/0.39	thf(c_0_14, plain, ![X1:$i, X8:$i > $i, X5:$i, X4:$i, X3:$i > $i > $o, X2:$i]:(in @ (kpair @ X1 @ X2) @ (lam @ X4 @ X5 @ X8)|(epred1_3 @ X8)!=(epred2_3 @ X3)|~in @ X2 @ X5|~in @ X1 @ X4|~X3 @ X1 @ X2), inference(er,[status(thm)],[inference(er,[status(thm)],[inference(ext_sup,[status(thm)],[c_0_12, c_0_13])])])).
0.19/0.39	thf(c_0_15, negated_conjecture, ![X1:$i]:(in @ (esk5_0 @ X1) @ esk4_0|~in @ X1 @ esk3_0), inference(split_conjunct,[status(thm)],[c_0_10])).
0.19/0.39	thf(c_0_16, plain, ![X56:$i, X57:$i, X58:$i > $i > $o]:((~epred2_3 @ X58 @ X57 @ X56|X58 @ X57 @ X56)&(~X58 @ X57 @ X56|epred2_3 @ X58 @ X57 @ X56)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])).
0.19/0.39	thf(c_0_17, negated_conjecture, ![X1:$i, X3:$i > $i > $o, X2:$i, X8:$i > $i, X4:$i]:(in @ (kpair @ X1 @ (esk5_0 @ X2)) @ (lam @ X4 @ esk4_0 @ X8)|(epred1_3 @ X8)!=(epred2_3 @ X3)|~X3 @ X1 @ (esk5_0 @ X2)|~in @ X2 @ esk3_0|~in @ X1 @ X4), inference(spm,[status(thm)],[c_0_14, c_0_15])).
0.19/0.39	thf(c_0_18, plain, ![X1:$i, X3:$i > $i > $o, X2:$i]:(epred2_3 @ X3 @ X1 @ X2|~X3 @ X1 @ X2), inference(split_conjunct,[status(thm)],[c_0_16])).
0.19/0.39	thf(c_0_19, plain, ![X53:$i, X54:$i, X55:$i > $i]:((~epred1_3 @ X55 @ X54 @ X53|(X55 @ X54)=(X53))&((X55 @ X54)!=(X53)|epred1_3 @ X55 @ X54 @ X53)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])).
0.19/0.39	thf(c_0_20, plain, ![X59:$i, X60:$i > $i]:(esk1_2 @ X60 @ X59)=(X60 @ X59), inference(variable_rename,[status(thm)],[c_0_5])).
0.19/0.39	thf(c_0_21, plain, ![X1:$i, X3:$i > $i > $o, X2:$i, X8:$i > $i, X4:$i]:(in @ (kpair @ X1 @ (esk5_0 @ X2)) @ (lam @ X4 @ esk4_0 @ X8)|(epred1_3 @ X8)!=(epred2_3 @ (epred2_3 @ X3))|~in @ X2 @ esk3_0|~X3 @ X1 @ (esk5_0 @ X2)|~in @ X1 @ X4), inference(spm,[status(thm)],[c_0_17, c_0_18])).
0.19/0.39	thf(c_0_22, negated_conjecture, in @ esk6_0 @ esk3_0, inference(split_conjunct,[status(thm)],[c_0_10])).
0.19/0.39	thf(c_0_23, plain, ![X1:$i, X8:$i > $i, X2:$i]:(epred1_3 @ X8 @ X1 @ X2|(X8 @ X1)!=(X2)), inference(split_conjunct,[status(thm)],[c_0_19])).
0.19/0.39	thf(c_0_24, plain, ![X8:$i > $i, X1:$i]:(esk1_2 @ X8 @ X1)=(X8 @ X1), inference(split_conjunct,[status(thm)],[c_0_20])).
0.19/0.39	thf(c_0_25, negated_conjecture, ![X1:$i, X8:$i > $i, X3:$i > $i > $o, X2:$i]:(in @ (kpair @ X1 @ (esk5_0 @ esk6_0)) @ (lam @ X2 @ esk4_0 @ X8)|(epred1_3 @ X8)!=(epred2_3 @ (epred2_3 @ X3))|~X3 @ X1 @ (esk5_0 @ esk6_0)|~in @ X1 @ X2), inference(spm,[status(thm)],[c_0_21, c_0_22])).
0.19/0.39	thf(c_0_26, plain, ![X8:$i > $i, X1:$i]:epred1_3 @ X8 @ X1 @ (X8 @ X1), inference(er,[status(thm)],[c_0_23])).
0.19/0.39	thf(c_0_27, negated_conjecture, (ap @ esk3_0 @ esk4_0 @ (lam @ esk3_0 @ esk4_0 @ (esk1_2 @ esk5_0)) @ esk6_0)!=(esk5_0 @ esk6_0), inference(split_conjunct,[status(thm)],[c_0_10])).
0.19/0.39	thf(c_0_28, plain, ![X8:$i > $i]:(esk1_2 @ X8)=(X8), inference(pos_ext,[status(thm)],[c_0_24])).
0.19/0.39	thf(c_0_29, negated_conjecture, ![X1:$i, X2:$i, X6:$i, X5:$i, X4:$i]:((ap @ X1 @ X2 @ X4 @ X5)=(X6)|~func @ X1 @ X2 @ X4|~in @ X5 @ X1|~in @ X6 @ X2|~in @ (kpair @ X5 @ X6) @ X4), inference(split_conjunct,[status(thm)],[c_0_10])).
0.19/0.39	thf(c_0_30, plain, ![X8:$i > $i, X1:$i]:(in @ (kpair @ esk6_0 @ (esk5_0 @ esk6_0)) @ (lam @ X1 @ esk4_0 @ X8)|(epred1_3 @ X8)!=(epred2_3 @ (epred2_3 @ (epred1_3 @ esk5_0)))|~in @ esk6_0 @ X1), inference(spm,[status(thm)],[c_0_25, c_0_26])).
0.19/0.39	thf(c_0_31, negated_conjecture, (ap @ esk3_0 @ esk4_0 @ (lam @ esk3_0 @ esk4_0 @ esk5_0) @ esk6_0)!=(esk5_0 @ esk6_0), inference(rw,[status(thm)],[c_0_27, c_0_28])).
0.19/0.39	thf(c_0_32, negated_conjecture, ![X1:$i, X2:$i, X8:$i > $i, X4:$i]:((ap @ X1 @ X2 @ (lam @ X4 @ esk4_0 @ X8) @ esk6_0)=(esk5_0 @ esk6_0)|(epred1_3 @ X8)!=(epred2_3 @ (epred2_3 @ (epred1_3 @ esk5_0)))|~func @ X1 @ X2 @ (lam @ X4 @ esk4_0 @ X8)|~in @ (esk5_0 @ esk6_0) @ X2|~in @ esk6_0 @ X1|~in @ esk6_0 @ X4), inference(spm,[status(thm)],[c_0_29, c_0_30])).
0.19/0.39	thf(c_0_33, negated_conjecture, ((epred2_3 @ (epred2_3 @ (epred1_3 @ esk5_0)))!=(epred1_3 @ esk5_0)|~func @ esk3_0 @ esk4_0 @ (lam @ esk3_0 @ esk4_0 @ esk5_0)|~in @ (esk5_0 @ esk6_0) @ esk4_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31, c_0_32]), c_0_22])])).
0.19/0.39	thf(c_0_34, negated_conjecture, ((epred2_3 @ (epred2_3 @ (epred1_3 @ esk5_0)) @ esk141_0 @ esk142_0)!=(epred1_3 @ esk5_0 @ esk141_0 @ esk142_0)|~func @ esk3_0 @ esk4_0 @ (lam @ esk3_0 @ esk4_0 @ esk5_0)|~in @ (esk5_0 @ esk6_0) @ esk4_0), inference(neg_ext,[status(thm)],[c_0_33])).
0.19/0.39	thf(c_0_35, negated_conjecture, ![X1:$i, X8:$i > $i, X2:$i]:(func @ X1 @ X2 @ (lam @ X1 @ X2 @ (esk1_2 @ X8))|~in @ (X8 @ (esk2_3 @ X1 @ X2 @ X8)) @ X2), inference(split_conjunct,[status(thm)],[c_0_10])).
0.19/0.39	thf(c_0_36, negated_conjecture, (epred2_3 @ (epred2_3 @ (epred1_3 @ esk5_0)) @ esk141_0 @ esk142_0|epred1_3 @ esk5_0 @ esk141_0 @ esk142_0|~func @ esk3_0 @ esk4_0 @ (lam @ esk3_0 @ esk4_0 @ esk5_0)|~in @ (esk5_0 @ esk6_0) @ esk4_0), inference(dynamic cnf,[status(thm)],[c_0_34])).
0.19/0.39	thf(c_0_37, negated_conjecture, ![X1:$i, X8:$i > $i, X2:$i]:(func @ X1 @ X2 @ (lam @ X1 @ X2 @ X8)|~in @ (X8 @ (esk2_3 @ X1 @ X2 @ X8)) @ X2), inference(rw,[status(thm)],[c_0_35, c_0_28])).
0.19/0.39	thf(c_0_38, negated_conjecture, (~func @ esk3_0 @ esk4_0 @ (lam @ esk3_0 @ esk4_0 @ esk5_0)|~epred2_3 @ (epred2_3 @ (epred1_3 @ esk5_0)) @ esk141_0 @ esk142_0|~epred1_3 @ esk5_0 @ esk141_0 @ esk142_0|~in @ (esk5_0 @ esk6_0) @ esk4_0), inference(dynamic cnf,[status(thm)],[c_0_34])).
0.19/0.39	thf(c_0_39, plain, ![X1:$i, X3:$i > $i > $o, X2:$i]:(X3 @ X1 @ X2|~epred2_3 @ X3 @ X1 @ X2), inference(split_conjunct,[status(thm)],[c_0_16])).
0.19/0.39	thf(c_0_40, negated_conjecture, ![X1:$i, X2:$i, X8:$i > $i]:(in @ (esk2_3 @ X1 @ X2 @ X8) @ X1|func @ X1 @ X2 @ (lam @ X1 @ X2 @ (esk1_2 @ X8))), inference(split_conjunct,[status(thm)],[c_0_10])).
0.19/0.39	thf(c_0_41, negated_conjecture, (epred2_3 @ (epred2_3 @ (epred1_3 @ esk5_0)) @ esk141_0 @ esk142_0|epred1_3 @ esk5_0 @ esk141_0 @ esk142_0|~func @ esk3_0 @ esk4_0 @ (lam @ esk3_0 @ esk4_0 @ esk5_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36, c_0_15]), c_0_22])])).
0.19/0.39	thf(c_0_42, negated_conjecture, ![X1:$i]:(func @ X1 @ esk4_0 @ (lam @ X1 @ esk4_0 @ esk5_0)|~in @ (esk2_3 @ X1 @ esk4_0 @ esk5_0) @ esk3_0), inference(spm,[status(thm)],[c_0_37, c_0_15])).
0.19/0.39	thf(c_0_43, plain, (~func @ esk3_0 @ esk4_0 @ (lam @ esk3_0 @ esk4_0 @ esk5_0)|~epred2_3 @ (epred1_3 @ esk5_0) @ esk141_0 @ esk142_0|~in @ (esk5_0 @ esk6_0) @ esk4_0), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38, c_0_18]), c_0_39])).
0.19/0.39	thf(c_0_44, negated_conjecture, ![X8:$i > $i, X2:$i, X1:$i]:(func @ X1 @ X2 @ (lam @ X1 @ X2 @ X8)|in @ (esk2_3 @ X1 @ X2 @ X8) @ X1), inference(rw,[status(thm)],[c_0_40, c_0_28])).
0.19/0.39	thf(c_0_45, negated_conjecture, (epred2_3 @ (epred2_3 @ (epred1_3 @ esk5_0)) @ esk141_0 @ esk142_0|epred1_3 @ esk5_0 @ esk141_0 @ esk142_0|~in @ (esk2_3 @ esk3_0 @ esk4_0 @ esk5_0) @ esk3_0), inference(spm,[status(thm)],[c_0_41, c_0_42])).
0.19/0.39	thf(c_0_46, negated_conjecture, (~in @ (esk2_3 @ esk3_0 @ esk4_0 @ esk5_0) @ esk3_0|~epred2_3 @ (epred1_3 @ esk5_0) @ esk141_0 @ esk142_0|~in @ (esk5_0 @ esk6_0) @ esk4_0), inference(spm,[status(thm)],[c_0_43, c_0_42])).
0.19/0.39	thf(c_0_47, negated_conjecture, (epred2_3 @ (epred2_3 @ (epred1_3 @ esk5_0)) @ esk141_0 @ esk142_0|epred1_3 @ esk5_0 @ esk141_0 @ esk142_0), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41, c_0_44]), c_0_45])).
0.19/0.39	thf(c_0_48, negated_conjecture, (~epred2_3 @ (epred1_3 @ esk5_0) @ esk141_0 @ esk142_0|~in @ (esk5_0 @ esk6_0) @ esk4_0), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43, c_0_44]), c_0_46])).
0.19/0.39	thf(c_0_49, plain, epred2_3 @ (epred1_3 @ esk5_0) @ esk141_0 @ esk142_0, inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39, c_0_47]), c_0_18])).
0.19/0.39	thf(c_0_50, negated_conjecture, ~in @ (esk5_0 @ esk6_0) @ esk4_0, inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48, c_0_49])])).
0.19/0.39	thf(c_0_51, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50, c_0_15]), c_0_22])]), ['proof']).
0.19/0.39	# SZS output end CNFRefutation
0.19/0.39	# Proof object total steps             : 52
0.19/0.39	# Proof object clause steps            : 37
0.19/0.39	# Proof object formula steps           : 15
0.19/0.39	# Proof object conjectures             : 28
0.19/0.39	# Proof object clause conjectures      : 25
0.19/0.39	# Proof object formula conjectures     : 3
0.19/0.39	# Proof object initial clauses used    : 12
0.19/0.39	# Proof object initial formulas used   : 5
0.19/0.39	# Proof object generating inferences   : 15
0.19/0.39	# Proof object simplifying inferences  : 18
0.19/0.39	# Training examples: 0 positive, 0 negative
0.19/0.39	# Parsed axioms                        : 14
0.19/0.39	# Removed by relevancy pruning/SinE    : 0
0.19/0.39	# Initial clauses                      : 22
0.19/0.39	# Removed in clause preprocessing      : 9
0.19/0.39	# Initial clauses in saturation        : 13
0.19/0.39	# Processed clauses                    : 163
0.19/0.39	# ...of these trivial                  : 0
0.19/0.39	# ...subsumed                          : 2
0.19/0.39	# ...remaining for further processing  : 161
0.19/0.39	# Other redundant clauses eliminated   : 33
0.19/0.39	# Clauses deleted for lack of memory   : 0
0.19/0.39	# Backward-subsumed                    : 11
0.19/0.39	# Backward-rewritten                   : 2
0.19/0.39	# Generated clauses                    : 342
0.19/0.39	# ...of the previous two non-trivial   : 299
0.19/0.39	# Contextual simplify-reflections      : 6
0.19/0.39	# Paramodulations                      : 117
0.19/0.39	# Factorizations                       : 0
0.19/0.39	# NegExts                              : 141
0.19/0.39	# Equation resolutions                 : 33
0.19/0.39	# Propositional unsat checks           : 0
0.19/0.39	#    Propositional check models        : 0
0.19/0.39	#    Propositional check unsatisfiable : 0
0.19/0.39	#    Propositional clauses             : 0
0.19/0.39	#    Propositional clauses after purity: 0
0.19/0.39	#    Propositional unsat core size     : 0
0.19/0.39	#    Propositional preprocessing time  : 0.000
0.19/0.39	#    Propositional encoding time       : 0.000
0.19/0.39	#    Propositional solver time         : 0.000
0.19/0.39	#    Success case prop preproc time    : 0.000
0.19/0.39	#    Success case prop encoding time   : 0.000
0.19/0.39	#    Success case prop solver time     : 0.000
0.19/0.39	# Current number of processed clauses  : 118
0.19/0.39	#    Positive orientable unit clauses  : 6
0.19/0.39	#    Positive unorientable unit clauses: 0
0.19/0.39	#    Negative unit clauses             : 2
0.19/0.39	#    Non-unit-clauses                  : 110
0.19/0.39	# Current number of unprocessed clauses: 162
0.19/0.39	# ...number of literals in the above   : 788
0.19/0.39	# Current number of archived formulas  : 0
0.19/0.39	# Current number of archived clauses   : 42
0.19/0.39	# Clause-clause subsumption calls (NU) : 3777
0.19/0.39	# Rec. Clause-clause subsumption calls : 1271
0.19/0.39	# Non-unit clause-clause subsumptions  : 19
0.19/0.39	# Unit Clause-clause subsumption calls : 15
0.19/0.39	# Rewrite failures with RHS unbound    : 0
0.19/0.39	# BW rewrite match attempts            : 6
0.19/0.39	# BW rewrite match successes           : 2
0.19/0.39	# Condensation attempts                : 0
0.19/0.39	# Condensation successes               : 0
0.19/0.39	# Termbank termtop insertions          : 12791
0.19/0.39	
0.19/0.39	# -------------------------------------------------
0.19/0.39	# User time                : 0.052 s
0.19/0.39	# System time              : 0.003 s
0.19/0.39	# Total time               : 0.055 s
0.19/0.39	# Maximum resident set size: 1656 pages
0.19/0.39	EOF